A Multi-Decision Area Based Approach for Solving Correspondence Problem in Stereo Images with High Accuracy
نویسندگان
چکیده
In computer vision and digital photogrammetry solving the correspondence problem is one of the most important field of research. Conventional methods used to generate dense density maps for stereo image pairs is classified as either area based or feature based methods. In this paper a multi decision area based approach has been proposed that performs pixel matching in stereo-pairs. The approach makes use of various matching methods at different stages depending upon the value of parameter that has been used as Decision Factor. Normalized Cross Correlation which is a measure of similarity between windows has been used as decision factor, if maximum Normalized Cross Correlation calculated exceeds a certain upper threshold it is considered as If Normalized Cross Correlation value lies in midrange, 2 nd stage analysis is performed that makes use of Edge Analysis and Euclidian distance while spline fitting is employed for lower values of decision factor, if NCC obtained falls below lower limit, no match is obtained. With the multistage approach & parallel processing speed of dense disparity map generation will improve along with improved accuracy. The method is tolerant to geometric distortions. The percentage of accurately matched pixels in stereo pairs was found to be 94.15% in one of the test data set, which was very high compared to standard Normalized Cross Correlation based approach (72%).
منابع مشابه
Providing a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملMMDT: Multi-Objective Memetic Rule Learning from Decision Tree
In this article, a Multi-Objective Memetic Algorithm (MA) for rule learning is proposed. Prediction accuracy and interpretation are two measures that conflict with each other. In this approach, we consider accuracy and interpretation of rules sets. Additionally, individual classifiers face other problems such as huge sizes, high dimensionality and imbalance classes’ distribution data sets. This...
متن کاملA New Method For Solving Linear Bilevel Multi-Objective Multi-Follower Programming Problem
Linear bilevel programming is a decision making problem with a two-level decentralized organization. The leader is in the upper level and the follower, in the lower level. This study addresses linear bilevel multi-objective multi-follower programming (LB-MOMFP) problem, a special case of linear bilevel programming problems with one leader and multiple followers where each decision maker has sev...
متن کاملA Parametric Approach for Solving Multi-Objective Linear Fractional Programming Phase
In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...
متن کاملSolving New Product Selection Problem by a New Hierarchical Group Decision-making Approach with Hesitant Fuzzy Setting
Selecting the most suitable alternative under uncertainty is considered as a critical decision-making problem that affects the success of organizations. In the selection process, there are a number of assessment criteria, considered by a group of decision makers, which often could be established in a multi-level hierarchy structure. The aim of this paper is to introduce a new hierarchical multi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017